On self duality of pathwidth in polyhedral graph embeddings
نویسندگان
چکیده
Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth of a graph with the cut-width of its medial graph and we extend it to bounded genus embeddings. We also show that there exist 3-connected planar graphs such that the pathwidth of such a graph is at least 1.5 times the pathwidth of its dual. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 42–54, 2007
منابع مشابه
On Self-Duality of Branchwidth in Graphs of Bounded Genus
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been examined for several width-parameters, such as branchwidth, pathwidth, and treewidth. In this paper, we give a direct proof of the self-duality of branchwidth in graphs embedded in some surface. In this direction, we ...
متن کاملOn Polyhedral Embeddings of Cubic Graphs
Polyhedral embeddings of cubic graphs by means of certain operations are studied. It is proved that some known families of snarks have no (orientable) polyhedral embeddings. This result supports a conjecture of Grünbaum that no snark admits an orientable polyhedral embedding. This conjecture is verified for all snarks having up to 30 vertices using computer. On the other hand, for every nonorie...
متن کاملEmbeddings of Polytopes and Polyhedral Complexes
of the Dissertation Embeddings of Polytopes and Polyhedral Complexes
متن کاملPathwidth, trees, and random embeddings
We prove that, for every integer k ≥ 1, every shortest-path metric on a graph of pathwidth k embeds into a distribution over random trees with distortion at most c = c(k), independent of the graph size. A well-known conjecture of Gupta, Newman, Rabinovich, and Sinclair [GNRS04] states that for every minor-closed family of graphs F , there is a constant c(F) such that the multi-commodity max-flo...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 55 شماره
صفحات -
تاریخ انتشار 2007